Effective process times for multi-server flowlines with finite buffers
نویسندگان
چکیده
منابع مشابه
Approximate analysis of single-server tandem queues with finite buffers
In this paper we study single-server tandem queues with general service times and finite buffers. Jobs are served according to the Blocking-After-Service protocol. To approximately determine the throughput and mean sojourn time, we decompose the tandem queue into single-buffer subsystems, the service times of which include starvation and blocking, and then iteratively estimate the unknown param...
متن کاملTandem queues with subexponential service times and finite buffers
We focus on tandem queues with subexponential service time distributions. We assume that number of customers in front of the first station is infinite and there is infinite room for finished customers after the last station but the size of the buffer between two consecutive stations is finite. Using (max,+) linear recursions, we investigate the tail asymptotics of transient response times and w...
متن کاملPerformance analysis of exponential multi-server production lines with fluid flow and finite buffers
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملAlternative Formulations for Flexible Flowlines with Sequence-dependent Setup Times
Alternative IP formulations for scheduling flexible flowlines with sequence-dependent setup times will be presented. While one does not differentiate between the machines at each stage, the other does. The differences in the formulations based on ease of implementation and ease of extension to variants of the problem will be discussed.
متن کاملAn approximation for multi-server queues with deterministic reneging times
In this paper, we studied multi-server queue with Poisson arrivals, general service time distribution, and deterministic reneging times. This work was motivated by the timeout mechanism used in managing application servers in transaction processing environments. In such systems, a customer who stays in the queue longer than the timeout period is lost. We proposed a scaling approach, and a fast ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IIE Transactions
سال: 2008
ISSN: 0740-817X,1545-8830
DOI: 10.1080/07408170701488029